class Solution:
    def minDistance(self, word1: 'str', word2: 'str') -> 'int':
        dp = [[0 for _ in range(len(word2) + 1)]
              for _ in range(len(word1) + 1)]
        for i in range(1, len(word1) + 1):
            for j in range(1, len(word2) + 1):
                if word1[i - 1] == word2[j - 1]:
                    dp[i][j] = dp[i - 1][j - 1] + 1
                else:
                    dp[i][j] = max(dp[i - 1][j], dp[i][j - 1])
        ops1 = len(word1) - dp[-1][-1]
        ops2 = len(word2) - dp[-1][-1]

        return ops1 + ops2
